Efficient Job Allocation∗
نویسندگان
چکیده
This paper considers equilibrium directed search with a finite number of heterogeneous workers and firms, where firms compete in direct mechanisms. Unlike previous findings, Nash equilibrium here does solve the problem of coordination failure. Restricting the match value function to be supermodular, and that firms use truthful strategies also imply positive assortative matching and decentralized trading prices which are consistent with the stable (cooperative equilibrium) outcome. The equilibrium mechanism is not an auction. Instead, to attract better skilled workers, firms post a fixed wage rule and hire the most skilled applicant who applies.
منابع مشابه
An Integrated Processor Allocation and Job Scheduling Approach to Workload Management on Computing Grid
Processor allocation and job scheduling are two complementary techniques for improving the performance of parallel systems. This paper presents an effort in studying the issues of processor allocation and job scheduling on the emerging computing grid platform and developing an integrated approach to efficient workload management. The experimental results indicate that through careful design of ...
متن کاملffi cient Job Upgrading , Search on the Job and Output Dispersion ∗
A worker’s job can be improved through on-the-job search (OJS) and job upgrading. Incorporating these external and internal job dynamics into a directed search model, this paper analytically characterizes the socially efficient allocation and quantitatively evaluates the model. The analysis shows that efficient OJS is front-loaded in a worker’s career and stops after a finite number of job swit...
متن کاملAdaptively Parallel Processor Allocation for Cilk Jobs
The problem of allocating processor resources fairly and efficiently to parallel jobs has been studied extensively in the past. Most of this work, however, assumes that the instantaneous parallelism of the jobs is known and used by the job scheduler to make its decisions. In this project, we consider different ways of estimating the parallelism of jobs during runtime, as well as different ways ...
متن کاملCost-based Job grouping and Scheduling Algorithm for Grid computing Environments
The integration of remote and diverse resources and the increasing computational needs of Grand challenges problems combined with faster growth of the internet and communication technologies leads to the development of global computational grids. Grid computing is a prevailing technology, which unites underutilized resources in order to support sharing of resources and services distributed acro...
متن کاملComparative Study on Parallel Data Processing for Resource Allocation in Cloud Computing
–Parallel data processing in cloud has emerged to be one killer application for infrastructure as service to integrate framework for products like portfolio, access these services and deploys the program. Scheduling job process in cloud computing for parallel data processing framework is Nephele. Our analysis presents expected performance of parallel job processing. Nephele is the processing fr...
متن کاملAdaptive Cost Optimization and Fair Resource Allocation in Computational Grid Systems
Grid computing systems offer large scale computing resources and can help carry out computation intensive jobs with improved efficiency and reduced business costs. Due to the heterogeneity of the computation and communication resources in these grid systems, efficient allocation of user jobs to resources is essential for reducing the execution time and costs. In this paper, we study an adaptive...
متن کامل